common divisor

Greatest Common Divisor Matrix and Least Common Multiple Matrix

最大公因子矩阵与最小公倍数矩阵

A computer program for expressing the greatest common divisor of two positive integers using their linear combination is given here.

给出了用其整系数线性组合表示两个正整数的最大公约数的计算机程序。

Greatest common divisor and modular inversion are resolved with Euclid algorithm and extended Euclid algorithm, respectively.

分别使用Euclid算法和扩展Euclid算法求解最大公约数和模逆。

A simulation of a circuit to calculate GCD Greater Common Divisor.

模拟电路来计算最大公因子大公因式.

Based on C/ C++ language the author devises programs of positive integer greatest common divisor algorithms. By analyzing algorithms, the author presents some suggestions of programming language teaching.

设计出了基于C/C++语言最大公约数算法程序，通过分析算法，提出了程序设计语言教学的几点建议。

The common divisor pact is the most important self-government regulation.

业主公约是全体业主的最高 自治 规则.

The greatest common divisor of 24 and 30 is 6 24.

和30的最大公约数为6。

The spurious lines caused by those sources can be classified into different sets according to the greatest common divisor of the DDS frequency control word ( FCW) and 2 N, where N is the word length of the DDS phase accumulator.

由此产生的杂散谱可根据DDS的频率控制字和2N的最大公约数进行分类，N是DDS相位累加器的字长。

The Problem of Finding the Coefficients for the Linear Expression of the Greatest Common Divisor

最大公约数线性表达式系数的求解问题

In this paper the relationship between memory contention and ( a, M), the greatest common divisor of a and M, is investigated, where M is the number of parallel memory modules, and a is a constant increment of address.

本文论述了以增量a（常数）访问M个体组成的并行存储器时，存取碰头和（a，M）的关系，这里（a，M）表示a和M的最大公因数。

We divide both by their common divisor.

用它们的公因子去除两个数.

Two extended Petri net models for implemetation of modulus and finding maximum common divisor

模运算及求最大公约数的增广PETRI网模型